Interval incidence coloring of subcubic graphs
نویسندگان
چکیده
For a given simple graph G = (V,E), we define an incidence as a pair (v, e), where vertex v ∈ V (G) is one of the ends of edge e ∈ E(G). Let us define a set of incidences I(G) = {(v, e) : v ∈ V (G)∧ e ∈ E(G)∧ v ∈ e}. We say that two incidences (v, e) and (w, f) are adjacent if one of the following holds: (i) v = w, e 6= f , (ii) e = f , v 6= w, (iii) e = {v, w}, f = {w, u} and v 6= u. By an incidence coloring of G we mean a function c : I(G)→ N such that c((v, e)) 6= c((w, f)) for any adjacent incidences (v, e) and (w, f) [1]. By an interval incidence coloring we mean an incidence coloring such that the set of colors of incidences adjoining the same vertex forms an interval, and by interval incidence coloring number χii we mean the smallest number of colors in any interval incidence coloring. This problem was studied in [2, 3]. The open question is whether χii(G) ≤ 2∆ in general case [3]. We solved this problem for any subcubic graph G, i.e. we proved χii(G) ≤ 6.
منابع مشابه
Coloring Algorithms on Subcubic Graphs
We present efficient algorithms for three coloring problems on subcubic graphs. (A subcubic graph has maximum degree at most three.) The first algorithm is for 4-edge coloring, or more generally, 4-list-edge coloring. Our algorithm runs in linear time, and appears to be simpler than previous ones. The second algorithm is the first randomized EREW PRAM algorithm for the same problem. It uses O(n...
متن کاملOn packing chromatic number of subcubic outerplanar graphs
The question of whether subcubic graphs have finite packing chromatic number or not is still open although positive responses are known for some subclasses, including subcubic trees, base-3 Sierpiski graphs and hexagonal lattices. In this paper, we answer positively to the question for some subcubic outerplanar graphs. We provide asymptotic bounds depending on structural properties of the weak ...
متن کاملOn list edge-colorings of subcubic graphs
In this paper we study list edge-colorings of graphs with small maximal degree. In particular, we show that simple subcubic graphs are '10/3-edge choosable'. The precise meaning of this statement is that no matter how we prescribe arbitrary lists of three colors on edges of a subgraph H of G such that A(H)~< 2, and prescribe lists of four colors on E(G)\E(H), the subcubic graph G will have an e...
متن کاملPlanarization and Acyclic Colorings of Subcubic Claw-Free Graphs
We study methods of planarizing and acyclically coloring claw-free subcubic graphs. We give a polynomial-time algorithm that, given such a graph G, produces an independent set Q of at most n/6 vertices whose removal from G leaves an induced planar subgraph P (in fact, P has treewidth at most four). We further show the stronger result that in polynomial-time a set of at most n/6 edges can be ide...
متن کاملAcyclic edge coloring of subcubic graphs
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using 5 colors. This result is tight since there are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 37 شماره
صفحات -
تاریخ انتشار 2017